Reconstruction of low-rank aggregation kernels in univariate population balance equations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning low-rank output kernels

Output kernel learning techniques allow to simultaneously learn a vector-valued function and a positive semidefinite matrix which describes the relationships between the outputs. In this paper, we introduce a new formulation that imposes a low-rank constraint on the output kernel and operates directly on a factor of the kernel matrix. First, we investigate the connection between output kernel l...

متن کامل

Probabilistic classifiers with low rank indefinite kernels

Indefinite similarity measures can be frequently found in bio-informatics by means of alignment scores, but are also common in other fields like shape measures in image retrieval. Lacking an underlying vector space, the data are given as pairwise similarities only. The few algorithms available for such data do not scale to larger datasets. Focusing on probabilistic batch classifiers, the Indefi...

متن کامل

Rank Aggregation via Low-Rank and Structured-Sparse Decomposition

Rank aggregation, which combines multiple individual rank lists to obtain a better one, is a fundamental technique in various applications such as meta-search and recommendation systems. Most existing rank aggregation methods blindly combine multiple rank lists with possibly considerable noises, which often degrades their performances. In this paper, we propose a new model for robust rank aggre...

متن کامل

A reconstruction problem related to balance equations

A modified k-deck of a graph is obtained by removing k edges in all possible ways and adding k (not necessarily new) edges in all possible ways. Krasikov and Roditty used these decks to give an independent proof of Müller’s result on the edge reconstructibility of graphs. They asked if a k-edge deck could be constructed from its modified k-deck. In this paper, we solve the problem when k = 1. W...

متن کامل

Numerical solution of population balance equations for nucleation, growth and aggregation processes

This article focuses on the derivation of numerical schemes for solving population balance models (PBMs) with simultaneous nucleation, growth nd aggregation processes. Two numerical methods are proposed for this purpose. The first method combines a method of characteristics (MOC) or growth process with a finite volume scheme (FVS) for aggregation process. For handling nucleation terms, a cell o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Computational Mathematics

سال: 2021

ISSN: 1019-7168,1572-9044

DOI: 10.1007/s10444-021-09871-w